Asymmetric error control under imperfect supervision: a label-noise-adjusted Neyman-Pearson umbrella algorithm

نویسندگان

چکیده

Label noise in data has long been an important problem supervised learning applications as it affects the effectiveness of many widely used classification methods. Recently, real-world applications, such medical diagnosis and cybersecurity, have generated renewed interest Neyman–Pearson (NP) paradigm, which constrains more severe type error (e.g., Type I error) under a preferred level while minimizing other II error). However, there little research on NP paradigm label noise. It is somewhat surprising that even when common classifiers ignore training stage, they are still able to control with high probability. price pay excessive conservativeness hence significant drop power (i.e., 1 - Assuming domain experts provide lower bounds corruption severity, we propose first theory-backed algorithm adapts most state-of-the-art methods paradigm. The resulting not only probability desired but also improve power.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neyman-Pearson classification under a strict constraint

Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with high probability: (i), its probability of type I error is below a pre-specifi...

متن کامل

Neyman-Pearson Classification under High-Dimensional Settings

Most existing binary classification methods target on the optimization of the overall classification risk and may fail to serve some real-world applications such as cancer diagnosis, where users are more concerned with the risk of misclassifying one specific class than the other. Neyman-Pearson (NP) paradigm was introduced in this context as a novel statistical framework for handling asymmetric...

متن کامل

Noise enhanced hypothesis-testing according to restricted Neyman-Pearson criterion

Noise enhanced hypothesis-testing is studied according to the restricted Neyman-Pearson (NP) criterion. First, a problem formulation is presented for obtaining the optimal probability distribution of additive noise in the restricted NP framework. Then, sufficient conditions for improvability and nonimprovability are derived in order to specify if additive noise can or cannot improve detection p...

متن کامل

Generalized Neyman - Pearson Lemma

We extend the classical Neyman-Pearson theory for testing composite hypotheses versus composite alternatives, using a convex duality approach as in Witting (1985). Results of Aubin & Ekeland (1984) from non-smooth convex analysis are employed, along with a theorem of Komll os (1967), in order to establish the existence of a max-min optimal test and to investigate its properties. The theory is i...

متن کامل

Neyman-Pearson Detection of Gaus Closed-Form Error Expone

The performance of Neyman-Pearson detection of correlated stochastic signals using noisy observations is investigated via the error exponent for the miss probability with a fixed level. Using the statespace structure of the signal and observation model, a closed-form expression for the error exponent is derived, and the connection between the asymptotic behavior of the optimal detector and that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2021

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2021.2016423